2-stage Fixed-point Iteration in a Modiied Plotkin Powerdomain

نویسنده

  • Torben Mogensen
چکیده

Powerdomains are used both when describing the semantics of non-deterministic programming languages and when doing abstract interpretation of deterministic programming languages. In the latter case, the restrictions imposed on sets in the usual powerdomain constructions can lead to less precise results than desired. We show a variant of the Plotkin (convex) powerdomain which impose fewer restrictions on the sets used. In this powerdomain, however, point-wise extensions of continuous functions are not necessarily continuous, and hence the least xed-point of a function might be diierent from the limit of the sequence obtained by iterated application of the function to the least element in the powerdomain. We solve this problem by showing that a 2-stage process involving limits in two diierent orderings will yield the least xed-point. We show an example of an analysis that beneet from the extended precision obtained by using the new powerdomain construction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on the Smyth Powerdomain Construction

Powerdomains are the order-theoretic analogue of powersets and are used to model non-determinism and concurrency [9, 8, 3, 10]. There exist three standard kinds of order-theoretic powerdomain: the Plotkin, Smyth and Hoare powerdomain. To obtain a powerdomain from a given !-algebraic cpo D, one constructs the collection F(D) of finite, non-empty sets of finite elements from D (for necessary defi...

متن کامل

New three-step iteration process and fixed point approximation in Banach spaces

‎In this paper we propose a new iteration process‎, ‎called the $K^{ast }$ iteration process‎, ‎for approximation of fixed‎ ‎points‎. ‎We show that our iteration process is faster than the existing well-known iteration processes using numerical examples‎. ‎Stability of the $K^{ast‎}‎$ iteration process is also discussed‎. ‎Finally we prove some weak and strong convergence theorems for Suzuki ge...

متن کامل

Solving time-fractional chemical engineering equations by modified variational iteration method as fixed point iteration method

The variational iteration method(VIM) was extended to find approximate solutions of fractional chemical engineering equations. The Lagrange multipliers of the VIM were not identified explicitly. In this paper we improve the VIM by using concept of fixed point iteration method. Then this method was implemented for solving system of the time fractional chemical engineering equations. The ob...

متن کامل

Complete Axioms for Categorical Fixed-Point Operators

We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We prove a general completeness theorem for iteration operators, relying on a new, purely syntactic characterisation of the free iteration theory. We then show how iteration operators arise in axiomatic domain theory. One re...

متن کامل

A Note on Powerdomains and Modalitiy

This note shows a simple connection between powerdomains and modal assertions that can be made about nondeterministic computations. We consider three kinds of powerdomains, the Plotkin powerdomain, the Smyth powerdomain and one Christened the Hoare power domain by Plotkin because it captures the partial correctness of a nondeterministic program. The modal operators are • for "inevitably" and <>...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997